Computability structures, simulations and realizability
نویسنده
چکیده
We generalize the standard construction of realizability models (specifically, of categories of assemblies) to a wide class of computability structures, broad enough to embrace models of computation such as labelled transition systems and process algebras. We consider a general notion of simulation between such computability structures, and show how these simulations correspond precisely to certain functors between the realizability models. Furthermore, we show that our class of computability structures has good closure properties — in particular, it is ‘cartesian closed’ in a slightly relaxed sense. Finally, we investigate some important subclasses of computability structures and of simulations between them. We suggest that our 2-category of computability structures and simulations may offer a useful framework for investigating questions of computational power, abstraction and simulability for a wide range of models.
منابع مشابه
Interactive Realizability for second-order Heyting arithmetic with EM1 and SK1
We introduce a classical realizability semantics based on interactive learning for full second-order Heyting Arithmetic with excluded middle and Skolem axioms over Σ1-formulas. Realizers are written in a classical version of Girard’s System F. Since the usual computability semantics does not apply to such a system, we introduce a constructive forcing/computability semantics: though realizers ar...
متن کاملRZ: A Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce code interfaces for the data structure corresponding to a mathematical theory. Our tool, called RZ, serves as a bridge between the worlds of constructive mathematics and programming. By using the realizability interpret...
متن کاملWorkshop on Realizability Preliminary Version Local Realizability Toposes and a Modal Logic for Computability (extended Abstract)
This work is a step toward developing a logic for types and computation that includes both the usual spaces of mathematics and constructions and spaces from logic and domain theory. Using realizability, we investigate a connguration of three toposes, which we regard as describing a notion of relative computability. Attention is focussed on a certain local map of toposes, which we study rst axio...
متن کاملRealizability as the Connection between Computable and Constructive Mathematics
These are lecture notes for a tutorial seminar which I gave at a satellite seminar of “Computability and Complexity in Analysis 2004” in Kyoto. The main message of the notes is that computable mathematics is the realizability interpretation of constructive mathematics. The presentation is targeted at an audience which is familiar with computable mathematics but less so with constructive mathema...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 24 شماره
صفحات -
تاریخ انتشار 2014